A scaling limit for the length of the longest cycle in a sparse random digraph

We discuss the length of the longest directed cycle in the sparse random digraph , constant. We show that for large there exists a function such that a.s. The function where is a polynomial in . We are only able to explicitly give the values , although we could in principle compute any .     

Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture

Recently F. M. Dekking conjectured the form of the subword complexity function for the Fibonacci–Thue–Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.     

On amenability of two-generator groups

A discrete group G is amenable if there exists a finitely additive probability measure on G which is invariant under left translations and is defined on all subsets of G. It is proved that if the group is generated by two elements and is amenable then there are words being relators whose most of the consecutive pairs of the letters belong to a certain four-element set of pairs. This fact is applied to reproving non-amenability of a braid group. The same group provides an example showing that such type of condition is not su?cient for amenabilty.     

Homogeneous variable exponent Besov and Triebel–Lizorkin spaces

We introduce homogeneous Besov and Triebel–Lizorkin spaces with variable indexes. We show that their study reduces to the study of inhomogeneous variable exponent spaces and homogeneous constant exponent spaces. Corollaries include trace space characterizations and Sobolev embeddings.     

On the domain of fractional Laplacians and related generators of Feller processes

In this paper we study the domain of the generator of stable processes, stable-like processes and more general pseudo- and integro-differential operators which naturally arise both in analysis and as infinitesimal generators of Lévy- and Lévy-type (Feller) processes. In particular we obtain conditions on the symbol of the operator ensuring that certain (variable order) Hölder and Hölder–Zygmund spaces are in the domain. We use tools from probability theory to investigate the small-time asymptotics of the generalized moments of a Lévy or Lévy-type process ${(X_t)}_{t\ge 0}$,

$\underset{t\to 0}{\lim }?\frac{1}{t}({\mathbb{E}}^{x}f(X_t)?f(x)),x\in {\mathbb{R}}^d,$

for functions f which are not necessarily bounded or differentiable. The pointwise limit exists for fixed $x\in {\mathbb{R}}^d$ if f satisfies a Hölder condition at x. Moreover, we give sufficient conditions which ensure that the limit exists uniformly in the space of continuous functions vanishing at infinity. As an application we prove that the domain of the generator of ${(X_t)}_{t\ge 0}$ contains certain Hölder spaces of variable order. Our results apply, in particular, to stable-like processes, relativistic stable-like processes, solutions of Lévy-driven SDEs and Lévy processes.     

Solvent‐free ring‐opening polymerization of lactones with hydrogen‐bonding bisurea catalyst

Development of effective organocatalysts for the living ring‐opening polymerization (ROP) of lactones is highly desired for the preparation of biocompatible and biodegradable polyesters with controlled microstructures and physical properties. Herein, a new class of hydrogen‐bond donating bisurea catalysts is reported for the ROP of lactones under solvent‐free conditions. ROP of lactones mediated by the bisurea/7‐methyl‐1,5,7‐triazabicyclo[4.4.0]dec‐5‐ene (MTBD) catalyst exhibits a living/controlled manner, affording the polymers and copolymers with the well‐defined structure, predictable molecular weight, narrow molecular weight distribution, and high selectivity for monomer at low catalyst loadings at ambient temperature. The possible mechanism of bisurea/MTBD‐catalyzed ROP of lactones is proposed, in which the bisurea activates the carbonyl group of lactones while MTBD facilitates the nucleophilic attack of the initiating/propagating alcohol by hydrogen bonding. Moreover, the poly(ε‐caprolactone‐co‐δ‐valerolactone) [P(CL‐co‐VL)] random copolymers with various compositions were synthesized using the bisurea/MTBD catalyst. The measurements of thermal properties and crystalline structure demonstrate that the CL and VL units are cocrystallized in the crystalline phase of P(CL‐co‐VL) copolymers. © 2018 Wiley Periodicals, Inc. J. Polym. Sci., Part A: Polym. Chem. 2019 , 57, 90–100     

Existential monadic second order logic of undirected graphs: The Le Bars conjecture is false

In 2001, J.-M. Le Bars disproved the zero-one law (that says that every sentence from a certain logic is either true asymptotically almost surely (a.a.s.), or false a.a.s.) for existential monadic second order sentences (EMSO) on undirected graphs. He proved that there exists an EMSO sentence ? such that $\mathsf{P}(G_n??)$ does not converge as $n\to \infty$ (here, the probability distribution is uniform over the set of all graphs on the labeled set of vertices $\{1,\dots ,n\}$). In the same paper, he conjectured that, for EMSO sentences with 2 first order variables, the zero-one law holds. In this paper, we disprove this conjecture.     

次线性期望下的一般中心极限定理

受Peng-中心极限定理的启发,本文主要应用G-正态分布的概念,放宽Peng-中心极限定理的条件,在次线性期望下得到形式更为一般的中心极限定理.首先,将均值条件E[X_n]=ε[X_n]=0放宽为|E[X_n]|+|ε[X_n]|=O(1/n);其次,应用随机变量截断的方法,放宽随机变量的2阶矩与2+δ阶矩条件;最后,将该定理的Peng-独立性条件进行放宽,得到卷积独立随机变量的中心极限定理.     

汽配件颜色喷涂顺序问题的TSP转化与建模

汽配件颜色喷涂顺序问题通常以生产线上相邻汽配件颜色切换次数少为最优目标,以进一步降低生产成本.该类问题具有所有汽配件都必须喷涂一次且只喷涂一次的特点,为此提出了TSP转化与建模的方法.将待喷涂汽配件定义为TSP顶点,任意两个待喷涂汽配件的颜色切换定义为顶点的距离,仿照TSP问题构建0-1规划模型;类似于顶点距离,将某些汽配件的颜色或类别不相邻要求定义为0-1矩阵,巧妙地构造了喷涂生产的约束条件.该建模方法简单快速,通用性高,适用于具有类似特点的各类生产实践问题.